A capability calculus for concurrency and determinism
نویسندگان
چکیده
منابع مشابه
A Calculus for True Concurrency
We design a calculus for true concurrency called CTC, including its syntax and operational semantics. CTC has good properties modulo several kinds of strongly truly concurrent bisimulations and weakly truly concurrent bisimulations, such as monoid laws, static laws, new expansion law for strongly truly concurrent bisimulations, τ laws for weakly truly concurrent bisimulations, and full congruen...
متن کاملRepresenting the Finite calculus in Multi Interaction Nets Concurrency Interaction Non determinism
We extend the Interaction Nets of Lafont with some non determinism capabilities and then show how to implement the nite monadic calculus in that system Introduction The calculus of Milner et al is one of the most popular theoretical tools for the investigation of concurrent computations Its popularity is due to its con ceptual simplicity yet great expressive power However similar to the calculu...
متن کاملCapability-Based Type Systems for Concurrency Control
Castegren, E. 2018. Capability-Based Type Systems for Concurrency Control. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1611. 106 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-513-0187-7. Since the early 2000s, in order to keep up with the performance predictions of Moore's law, hardware vendors have had to turn to multi-core com...
متن کاملA Lambda-Calculus with letrec, case, constructors and non-determinism
A non-deterministic call-by-need lambda-calculus λndlr with case, constructors, letrec and a (non-deterministic) erratic choice, based on rewriting rules is investigated. A standard reduction is defined as a variant of left-most outermost reduction. The semantics is defined by contextual equivalence of expressions instead of using αβ(η)-equivalence. It is shown that several program transformati...
متن کاملGlobal/local Subtyping and Capability Inference for a Distributed -calculus
This paper considers how locality restrictions on the use of capabilities can be enforced by a static type system. A distributed-calculus with a simple reduction semantics is introduced, integrating location and migration primitives from the Distributed Join Calculus with asynchronous communication. It is given a type system in which the input and output capabilities of channels may be either g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2008
ISSN: 0164-0925,1558-4593
DOI: 10.1145/1387673.1387676